Dynamic problem - PDFSEARCH.IO - Document Search Engine

Dynamic problem
Results: 444

#	Item
121	A global averaging method for dynamic time warping, with applications to clustering Franc¸ois Petitjeana,b,c,∗, Alain Ketterlina , Pierre Ganc¸arskia,b a University of Strasbourg, 7 rue Ren´e Descartes, 67084 Strasb Add to Reading List Source URL: dpt-info.u-strasbg.fr Language: English - Date: 2012-06-13 07:33:17 Bioinformatics Dynamic time warping Time series analysis Computational phylogenetics Computational linguistics Speech recognition Sequence Cluster analysis Longest common subsequence problem Statistics Dynamic programming Mathematics
122	POVERTY AND SELF-CONTROL B. Douglas Bernheim Stanford University and NBER Debraj Ray Add to Reading List Source URL: www.nyudri.org Language: English - Date: 2013-06-07 15:51:22 Problem solving Nash equilibrium Dynamic inconsistency Subgame perfect equilibrium Subgame Behavioral economics Hyperbolic discounting Trembling hand perfect equilibrium Game theory Economics Human behavior
123	On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai † Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-15 10:32:13 Operations research Combinatorial optimization NP-complete problems Mathematical optimization Dynamic programming Knapsack problem Job shop scheduling Optimization problem Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
124	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap Hamidreza Chitsaz∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:09:09 Theoretical computer science Mathematical optimization Operations research Network theory Motion planning Shortest path problem Dynamic programming Algorithm Visibility graph Mathematics Applied mathematics Graph theory
125	Constraint Models for the Container Pre-Marshaling Problem Andrea Rendl and Matthias Prandtstetter AIT Austrian Institute of Technology GmbH Mobility Department, Dynamic Transportation Systems Giefinggasse 2, 1210 Vienna Add to Reading List Source URL: andrearendl.com Language: English - Date: 2013-08-29 08:12:47 Container terminals Computing Container Object-oriented programming Sequence container Associative containers Stack Transport Abstract data types C++ Standard Library
126	Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772) Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:25 NP-complete problems Approximation algorithm Vertex cover Travelling salesman problem Graph coloring Metric k-center Dynamic programming Christofides algorithm Set cover problem Theoretical computer science Mathematics Computational complexity theory
127	Comparison of Dynamic Diffusion with an Explicit Difference Scheme for the Schrödinger Equation Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2014-03-11 12:49:15 Quantum decoherence Introduction to quantum mechanics Quantum potential Measurement problem Quantum hydrodynamics Creation and annihilation operators De Broglie–Bohm theory Quantum superposition Physics Quantum mechanics Schrödinger equation
128	OPTIMIZATION APPROACHES TO DYNAMIC ROUTING OF MEASUREMENTS AND MODELS IN A SENSOR NETWORK OBJECT TRACKING PROBLEM Jason L. Williams,1 John W. Fisher III,2 Alan S. Willsky3 1,3 2 MIT/LIDS Add to Reading List Source URL: ssg.mit.edu Language: English - Date: 2012-02-01 13:45:48 Sensors Computer networking Sensor node Wireless sensor network Kalman filter Sensor Dynamic programming Technology Systems theory Control theory
129	An O(ND) Difference Algorithm and Its Variations∗ EUGENE W. MYERS Department of Computer Science, University of Arizona, Tucson, AZ 85721, U.S.A. ABSTRACT Add to Reading List Source URL: xmailserver.org Language: English - Date: 2007-02-16 03:04:45 Operations research NP-complete problems Dynamic programming Equations Systems engineering Shortest path problem Longest common subsequence problem Graph Catalan number Mathematics Theoretical computer science Graph theory
130	CCCG 2011, Toronto ON, August 10–12, 2011 A Discrete and Dynamic Version of Klee’s Measure Problem Hakan Yıldız∗ John Hershberger† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Computing R-tree Segment tree K-d tree Measure B-tree Interval tree Fractional cascading Graph theory Binary trees Data management

UPDATE